Parallel-Addition Convolution Algorithm in Grayscale Image
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Image Convolution
In this paper, we compare the Redundant Boundary Computation (RBC) algorithm for convolution with traditional parallel methods. This algorithm dramatically reduces the communication cost for the the computation in certain environments. We theoretically and experimentally study the conventional parallel algorithm and the RBC algorithm. First, we discuss the performance of these parallel algorith...
متن کاملA Parallel Thinning Algorithm for Grayscale Images
Grayscale skeletonization offers an interesting alternative to traditional skeletonization following a binarization. It is well known that parallel algorithms for skeletonization outperform sequential ones in terms of quality of results, yet no general and well defined framework has been proposed until now for parallel grayscale thinning. We introduce in this paper a parallel thinning algorithm...
متن کاملParallel Algorithms For Image Convolution yShuling
In this paper, we compare the Redundant Boundary Computation (RBC) algorithm for convolution with traditional parallel methods. This algorithm dramatically reduces the communication cost for the the computation in certain environments. We theoretically and experimentally study the conventional parallel algorithm and the RBC algorithm. First, we discuss the performance of these parallel algorith...
متن کاملComparative Performance Analysis of Parallel Algorithm Models in Message-Passing Image Convolution Implementations
In this paper we present and analyze the performance of different image convolution implementations based on five parallel algorithm models: phase parallel, process farm, divide and conquer, work pool and pipeline. Our main objective is to analyze the performance of parallel algorithm models through message-passing image convolution implementations, their development simplicity and their suitab...
متن کاملPeak Analysis of Grayscale Image: Algorithm and Application
Considered as topographic reliefs, grayscale images can be decomposed into a number of peaks that can be stored in the data structure of a tree. This decomposition is called the peak analysis of grayscale images in this paper. Its mathematical definition and its fast algorithm based on the watershed transform are both presented. Due to its intuitive definition, there is a wide range of applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korea Institute of Information, Electronics, and Communication Technology
سال: 2017
ISSN: 2005-081X
DOI: 10.17661/jkiiect.2017.10.4.288